Edge partitions of the countable triangle free homogeneous graph
نویسندگان
چکیده
منابع مشابه
Edge partitions of the countable triangle free homogeneous graph
In this paper we investigate edge partition problems of the countable triangle free homogeneous graph. As consequences of the main result, we obtain the following theorems. For every coloring of the edges of the countable triangle free homogeneous graph 0//with finitely many colors there exists a copy of q/in q/whose edges are colored with at most two of the colors. The countable triangle free ...
متن کاملThe Universal Homogeneous Triangle-free Graph Has Finite Ramsey Degrees
The universal homogeneous triangle-free graph H3 has finite ‘big Ramsey degrees’: For each finite triangle-free graph G, there is a finite number n(G) such that for any coloring c of all copies of G in H3 into finitely many colors, there is a subgraph H′ of H3 which is isomorphic to H3 in which c takes on no more than n(G) many colors. The proof hinges on the following developments: a new flexi...
متن کاملA local approach to the entropy of countable fuzzy partitions
This paper denes and investigates the ergodic proper-ties of the entropy of a countable partition of a fuzzy dynamical sys-tem at different points of the state space. It ultimately introducesthe local fuzzy entropy of a fuzzy dynamical system and proves itto be an isomorphism invariant.
متن کاملTriangle-free Partitions of Euclidean Space
The instance of this theorem when n = 2 was proved by Ceder [1]. Komjath [4] extended Ceder's result to IR, but with the weaker conclusion that no set of the partition contains the vertices of a regular tetrahedron. Subsequently, we extended Komjath's result to arbitrary dimension n in [7], where it was proved that there is a partition of IR" into countably many sets no one of which contains n ...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00169-6